A note on vertex pancyclic oriented graphs
نویسندگان
چکیده
Let D be an oriented graph of order n 9, minimum degree n ? 2, such for choice of distinct vertices x and y, either xy 2 E(D) or d + (x)+d ? (y) n?3. Song (J. Graph Theory 18 (1994), 461{468) proved that D is pancyclic. In this note, we give a short proof, based on Song's result, that D is in fact vertex pancyclic. This also generalizes a result of Jackson (J. Graph Theory 5 (1981), 147{157) for the existence of a hamiltonian cycle in oriented graphs. An oriented graph is a digraph without loops, multiple arcs, or cycles of length 2. The vertex set and the arc set of a digraph D are denoted by V (D) and E(D), respectively. If xy is an arc of D, then we say that x dominates y. More generally, for two disjoint subdigraphs A and B of D, if every vertex of A dominates every vertex of B, then we say that A dominates B, denoted by A ! B. In addition, we sometimes use the notation A) B to denote that there is no arc from B to A.
منابع مشابه
A note on uniquely pancyclic graphs
In this paper we consider uniquely pancyclic graphs, i.e. n vertex graphs with exactly one cycle of each length from 3 to n. The first result of the paper gives new upper and lower bounds on the number of edges in a uniquely pancyclic graph. Next we report on a computer search for new uniquely pancyclic graphs. We found that there are no new such graphs on n ≤ 59 vertices and that there are no ...
متن کاملVertex Pancyclic Graphs
Let G be a graph of order n. A graph G is called pancyclic if it contains a cycle of length k for every 36 k6 n, and it is called vertex pancyclic if every vertex is contained in a cycle of length k for every 36 k6 n. In this paper, we shall present di0erent su1cient conditions for graphs to be vertex pancyclic. ? 2002 Elsevier Science B.V. All rights reserved.
متن کاملA note on vertex-edge Wiener indices of graphs
The vertex-edge Wiener index of a simple connected graph G is defined as the sum of distances between vertices and edges of G. Two possible distances D_1(u,e|G) and D_2(u,e|G) between a vertex u and an edge e of G were considered in the literature and according to them, the corresponding vertex-edge Wiener indices W_{ve_1}(G) and W_{ve_2}(G) were introduced. In this paper, we present exact form...
متن کاملMinimum Degree Conditions for Cycles Including Specified Sets of Vertices
This paper generalises the concept of vertex pancyclic graphs. We define a graph as set-pancyclic if for every set S of vertices there is a cycle of every possible length containing S. We show that if the minimum degree of a graph exceeds half its order then the graph is set-pancyclic. We define a graph as k-ordered-pancyclic if, for every set S of cardinality k and every cyclic ordering of S, ...
متن کاملGeodesic-pancyclic graphs
A shortest path connecting two vertices u and v is called a u-v geodesic. The distance between u and v, denoted by dG(u, v), is the number of edges in a u-v geodesic. A graph G with n vertices is geodesic-pancyclic if for each pair of vertices u, v ∈ V (G), every u-v geodesic lies on every cycle of length k satisfying max{2dG(u, v), 3} ≤ k ≤ n. In this paper, we study the properties for graphs ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of Graph Theory
دوره 31 شماره
صفحات -
تاریخ انتشار 1999